package com.gxgeek.javabasic.base;

/**
 * 冒泡算法
 * Created by gx on 2017/7/20.
 */
public class BubbleSort {

    public static void main(String[] args) {
        int score[] = {67, 69, 75, 87, 89, 90, 99, 100};

//        for (int s =0; s<score.length-1;s++){
//            for (int d = 0 ;d<score.length-s-1;d++){
//                if (score[d]<score[d+1]){
//                    int temp =score[d];
//                    score[d]=score[d+1];
//                    score[d+1]=temp;
//                }
//            }
//        }
        for (int i = 0; i < score.length - 1; i++) {    //最多做n-1趟排序
            for (int j = 0; j < score.length - i - 1; j++) {    //对当前无序区间score[0......length-i-1]进行排序(j的范围很关键，这个范围是在逐步缩小的)
                if (score[j] < score[j + 1]) {    //把小的值交换到后面
                    int temp = score[j];
                    score[j] = score[j + 1];
                    score[j + 1] = temp;
                }
            }
            System.out.print("第" + (i + 1) + "次排序结果：");
            for (int a = 0; a < score.length; a++) {
                System.out.print(score[a] + "\t");
            }
            System.out.println("");
        }
        System.out.print("最终排序结果：");
        for (int a = 0; a < score.length; a++) {
            System.out.print(score[a] + "\t");
        }

    }
}
